Distance Constrained Location Problems
نویسندگان
چکیده
منابع مشابه
Solving Constrained Two-facility Location Problems
A general approach to optimally solve multiple facility location problems based on the “Big Triangle Small Triangle” approach to solving single facility problems is proposed. The proposed procedure is especially effective when the solution is constrained to a given polygon such as the convex hull of demand points. The procedure is tested on the two facilities Weber problem with attraction and r...
متن کاملUsing tropical optimization to solve constrained minimax single-facility location problems with rectilinear distance
We consider a constrained minimax single-facility location problem with addends on the plane with rectilinear distance. The problem is first formulated in a standard form, and then represented in terms of tropical mathematics as a constrained optimization problem. We apply methods and results of tropical optimization to obtain direct, explicit solutions to the optimization problem. The results ...
متن کاملLocation-Routing Problems with Distance Constraints
A important aspect of designing a distribution system is determining the locations of the facilities. For systems in which deliveries are made along multiple stop routes, the routing problem and location problem must be considered simultaneously. In this paper, a set-partitioning-based formulation of an uncapacitated location-routing model with distance constraints is presented. An alternate se...
متن کاملThe capacity and distance constrained plant location problem
This article introduces a new problem called the Capacity and Distance Constrained Plant Location Problem. It is an extension of the discrete capacitated plant location problem, where the customers assigned to each plant have to be packed in groups that will be served by one vehicle each. The paper addresses different modeling aspects of the problem. It describes a tabu search algorithm for its...
متن کاملApproximation algorithms for distance constrained vehicle routing problems
We study the distance constrained vehicle routing problem (DVRP) [20, 21]: given a set of vertices in a metric space, a specified depot, and a distance bound D, find a minimum cardinality set of tours originating at the depot that covers all vertices, such that each tour has length at most D. This problem is NP-complete, even when the underlying metric is induced by a weighted star. Our main re...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Industrial Engineering & Management
سال: 2015
ISSN: 2169-0316
DOI: 10.4172/2169-0316.1000181